Distributed algorithms for weighted problems in sparse graphs
نویسندگان
چکیده
We study distributed algorithms for three graph-theoretic problems in weighted trees and weighted planar graphs. For trees, we present an efficient deterministic distributed algorithm which finds an almost exact approximation of a maximum-weight matching. In addition, in the case of trees, we show how to approximately solve the minimum-weight dominating set problem. For planar graphs, we present an almost exact approximation for the maximum-weight independent set problem.
منابع مشابه
Improved algorithms for replacement paths problems in restricted graphs
We present near-optimal algorithms for two problems related to finding the replacement paths for edges with respect to shortest paths in sparse graphs. The problems essentially study how the shortest paths change as edges on the path fail, one at a time. Our technique improves the existing bounds for these problems on directed acyclic graphs, planar graphs, and non-planar integer-edge-weighted ...
متن کاملParallel Approximation Algorithms for the Weighted Maximum Matching Problem
We consider the problem of computing a matching in a large weighted graph using a parallel algorithm. Since an exact algorithm for the weighted matching problem is fairly costly we instead develop a fast approximation algorithm. The parallel algorithm is based on a distributed algorithm due to Hoepman [6]. Through experiments using both complete as well as sparse graphs we show that our new alg...
متن کاملTight Hardness for Shortest Cycles and Paths in Sparse Graphs
Fine-grained reductions have established equivalences between many core problems with Õ(n3)-time algorithms on n-node weighted graphs, such as Shortest Cycle, All-Pairs Shortest Paths (APSP), Radius, Replacement Paths, Second Shortest Paths, and so on. These problems also have Õ(mn)-time algorithms on m-edge n-node weighted graphs, and such algorithms have wider applicability. Are these mn boun...
متن کاملAlgorithms for alpha-rate domination problems on weighted graphs
In this article, we investigate a domination set problem variant on vertex-weighted graphs. In the last few years, several algorithms have been presented for solving the minimum alpha and alpha-rate domination problem (also known as the positive influence dominating sets problem) on simple graphs. We recently proposed an algorithm for alpha-rate domination on weighted graphs based on randomised...
متن کاملApproximation algorithms for distributed systems
Distributed Approximation is a new and rapidly developing discipline that lies at the crossroads of various well-established areas of Computer Science Distributed Computing, Approximation Algorithms, Graph Theory and often, Computational Geometry. This thesis focuses on the design and analysis of distributed algorithms to solve optimization problems that usually arise in large-scale, heavily dy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Discrete Algorithms
دوره 4 شماره
صفحات -
تاریخ انتشار 2006